Multiresolution image compression with BSP trees and multilevel BTC
نویسندگان
چکیده
This paper presents a new multiresolution segmentationbased algorithm for image compression. High quality low bit rate image compression is achieved by recursively coding the Binary Space Partitioning (BSP) tree representation of images with multilevel Block Truncation Coding (BTC). Comparison with JPEG at rates below 0.25 bit/pixel shows superior performance both in terms of Power Signal-to-Noise Ratio (PSNR) and subjec-
منابع مشابه
Image Compression Using Adaptive Multilevel Block Truncation Coding
The block truncation coding (BTC) algorithm for image compression has the advantages of low computation load and less memory requirement. In this paper, an adaptive image compression algorithm using multilevel BTC is proposed. An input image is partitioned into blocks with variable sizes, and the gray values of each block are adaptively quantized to be one, two, or four levels according to loca...
متن کاملA Nearly Optimum Generalized Multilevel Block Truncation Coding Algorithms With a Fast Nonexhaustive Search Based on a Mean Square Error Criterion
Block Truncation Coding (BTC), using a one-bit moment preserving quantizer to quantize a block, is a simple compression method; however, compression with BTC cannot be used to obtain a sufficiently high quality image, especially an image with many edges. In this paper, a new generalized multilevel BTC algorithm, which arbitrarily specifies the number of quantization levels, is developed. In the...
متن کاملMedical Image Registration Based on BSP and Quad-Tree Partitioning
This paper presents a study of image simplification techniques as a first stage to define a multiresolution registration framework. We propose here a new approach for image registration based on the partitioning of the source images in binary-space (BSP) and quad-tree structures. These partitioned images have been obtained with a maximum mutual information gain algorithm. Multimodal registratio...
متن کاملBinary space partitioning trees: a multiresolution approach
Space partitioning techniques are a useful means of organizing geometric models into data structures. Such data structures provide easy and efficient access to a wide range of computer graphics and visualization applications like real-time rendering of large data bases, collision detection, point classification, etc. Binary Space Partitioning (BSP) trees are one of the most successful space par...
متن کاملMultiresolution segmentation-based image coding with hierarchical data structures
This paper presents two multiresolution segmentation-based algorithms for low bit rate image compression using hierarchical data structures. The segmentation is achieved with quadtree and BSP-tree hierarchical data structures and the encoding is performed by using the projection pursuit (matching pursuit) with a finite dictionary of spline functions with various degrees of smoothness. Compariso...
متن کامل